27
27
Jun 17, 2014
06/14
by
Schacht, Al (Alexander), b. 1894; Keyes, Edward
texts
eye 27
favorite 1
comment 0
Topics: Schacht, Al (Alexander), b. 1894, Baseball players
2
2.0
Jun 29, 2018
06/18
by
H. Hàn; T. Retter; V. Rödl; M. Schacht
texts
eye 2
favorite 0
comment 0
A question of Erd\H{o}s asks if for every pair of positive integers $r$ and $k$, there exists a graph $H$ having $\textrm{girth}(H)=k$ and the property that every $r$-colouring of the edges of $H$ yields a monochromatic cycle $C_k$. The existence of such graphs was confirmed by the third author and Ruci\'nski. We consider the related numerical problem of determining the smallest such graph with this property. We show that for integers $r$ and $k$, there exists a graph $H$ on $R^{10k^2}...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1604.05066
Dissertation--Bern
Topic: Real property
Inaug.-diss.--Leipzig, 1884
Topic: Work environment
http://uf.catalog.fcla.edu/uf.jsp?st=UF000661911&ix=nu&I=0&V=D&pm=1
2
2.0
Jun 29, 2018
06/18
by
Mathias Schacht
texts
eye 2
favorite 0
comment 0
We study thresholds for extremal properties of random discrete structures. We determine the threshold for Szemer\'edi's theorem on arithmetic progressions in random subsets of the integers and its multidimensional extensions and we determine the threshold for Tur\'an-type problems for random graphs and hypergraphs. In particular, we verify a conjecture of Kohayakawa, \L uczak, and R\"odl for Tur\'an-type problems in random graphs. Similar results were obtained by Conlon and Gowers.
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1603.00894
Vita
Topics: Valdivia (Steamer), Deutsche Tiefsee-Expedition auf dem Dampfer "Valdivia" (1898-1899),...
52
52
Sep 18, 2013
09/13
by
Mihyun Kang; Mathias Schacht; Oleg Verbitsky
texts
eye 52
favorite 0
comment 0
We prove that if one wants to make a plane graph drawing straight-line then in the worst case one has to move almost all vertices.
Source: http://arxiv.org/abs/0707.3373v2
4
4.0
Jun 29, 2018
06/18
by
Heiner Oberkampf; Mathias Schacht
texts
eye 4
favorite 0
comment 0
We study structural properties of graphs with fixed clique number and high minimum degree. In particular, we show that there exists a function $L=L(r,\varepsilon)$, such that every $K_r$-free graph $G$ on $n$ vertices with minimum degree at least $(\frac{2r-5}{2r-3}+\varepsilon)n$ is homomorphic to a $K_r$-free graph on at most $L$ vertices. It is known that the required minimum degree condition is approximately best possible for this result. For $r=3$ this result was obtained by \L uczak [On...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1602.02302
11
11
Apr 11, 2018
04/18
by
Schacht, Wilhelm 1903-2001 aut (DE-101)124013368
texts
eye 11
favorite 0
comment 0
5
5.0
Jun 29, 2018
06/18
by
Yoshiharu Kohayakawa; Guilherme Oliveira Mota; Mathias Schacht
texts
eye 5
favorite 0
comment 0
Bal and DeBiasio [Partitioning random graphs into monochromatic components, arXiv:1509.09168] put forward a conjecture concerning the threshold for the following Ramsey-type property for graphs $G$: every $k$-colouring of the edge set of $G$ yields $k$ pairwise vertex disjoint monochromatic trees that partition the whole vertex set of $G$. We determine the threshold for this property for two colours.
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1611.10299
3
3.0
Oct 7, 2020
10/20
by
Schacht, John N., 1943-
texts
eye 3
favorite 0
comment 0
x, 282 pages ; 24 cm
Topics: Communications Workers of America -- History, Communications Workers of America, Communication and...
4
4.0
Jun 29, 2018
06/18
by
Yoshiharu Kohayakawa; Vojtěch Rödl; Mathias Schacht
texts
eye 4
favorite 0
comment 0
We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if they are sparse. This positively answers a question of Chung and Graham ["Sparse quasi-random graphs", Combinatorica 22 (2002), no. 2, 217-244] for the particular case of Cayley graphs of abelian groups, while in general the answer is negative.
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1602.02291
4
4.0
Jun 30, 2018
06/18
by
Dante Bigi; Paolo Gambino; Stefan Schacht
texts
eye 4
favorite 0
comment 0
We use recent Belle results on $\bar{B}^0\rightarrow D^{*+}l^-\bar{\nu}_l$ decays to extract the CKM element $|V_{cb}|$ with two different but well-founded parameterizations of the form factors. We show that the CLN and BGL parameterizations lead to quite different results for $|V_{cb}|$ and provide a simple explanation of this unexpected behaviour. A long lasting discrepancy between the inclusive and exclusive determinations of $|V_{cb}|$ may have to be thoroughly reconsidered.
Topics: High Energy Physics - Experiment, High Energy Physics - Phenomenology
Source: http://arxiv.org/abs/1703.06124
21
21
Dec 13, 2019
12/19
by
Wolfgang Schacht
texts
eye 21
favorite 0
comment 0
2
2.0
Jun 29, 2018
06/18
by
Christian Reiher; Vojtěch Rödl; Mathias Schacht
texts
eye 2
favorite 0
comment 0
We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\eta)$-quasirandom if for any subset $X\subseteq V$ and every set of pairs $P\subseteq V\times V$ the number of pairs $(x,(y,z))\in X\times P$ with $\{x,y,z\}$ being a hyperedge of $H$ is in the interval $d|X||P|\pm\eta|V|^3$. We show that for any $\varepsilon>0$ there exists $\eta>0$ such that every sufficiently large $(1/2+\varepsilon,\eta)$-quasirandom hypergraph contains...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1602.02289
3
3.0
Sep 5, 2020
09/20
by
Schacht, Martin 1965- Verfasser
texts
eye 3
favorite 1
comment 0
223 S. 20 cm
Topics: Alltag, Mentalität, Thailand, (Produktform)Hardback, Gebrauchsanweisung, Martin Schacht,...
Other Minds Music Reference Library
2
2.0
Aug 23, 2016
08/16
by
Chamber Orchestra La Strimpellata Bern; Hansjürg Kuhn; Piano, Michael Schacht; Speaker, Hans-Jürg Rickenbacker; Ten.; Vocal Ensemble Cantemus - Helene Ringgenberg
audio
eye 2
favorite 1
comment 0
Tracklist: 1. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of The Old Masters: 1. Adam De La Halle, 1250 2. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of The Old Masters: 2. Ludwig Senfl, 1510 3. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of The Old Masters: 3. George Frideric Handel, 1730 4. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of...
Source: CD
5
5.0
Jun 29, 2018
06/18
by
Christian Reiher; Vojtěch Rödl; Mathias Schacht
texts
eye 5
favorite 0
comment 0
Extremal problems for $3$-uniform hypergraphs are known to be very difficult and despite considerable effort the progress has been slow. We suggest a more systematic study of extremal problems in the context of quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is weakly $(d,\eta)$-quasirandom if for any subset $U\subseteq V$ the number of hyperedges of $H$ contained in $U$ is in the interval $d\binom{|U|}{3}\pm\eta|V|^3$. We show that for any $\varepsilon>0$ there...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1602.02290
22
22
Sep 26, 2011
09/11
by
Schacht, Maryann
texts
eye 22
favorite 0
comment 0
Includes bibliographical references
Topics: Self-Help, Psychological Aspects Of Bereavement, Terminal Care Nursing, Diet / Health / Fitness,...
5
5.0
Jun 29, 2018
06/18
by
Josefran de Oliveira Bastos; Guilherme Oliveira Mota; Mathias Schacht; Jakob Schnitzer; Fabian Schulenburg
texts
eye 5
favorite 0
comment 0
We prove that for all $k\geq 4$ and $1\leq\ell
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1603.04180
2
2.0
Jun 29, 2018
06/18
by
Mathias Schacht; Fabian Schulenburg
texts
eye 2
favorite 0
comment 0
For a given graph $F$ we consider the family of (finite) graphs $G$ with the Ramsey property for $F$, that is the set of such graphs $G$ with the property that every two-colouring of the edges of $G$ yields a monochromatic copy of $F$. For $F$ being a triangle Friedgut, R\"odl, Ruci\'nski, and Tetali (2004) established the sharp threshold for the Ramsey property in random graphs. We obtained a simpler proof of this result which extends to a more general class of graphs $F$ including all...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1602.02501
2
2.0
Jun 30, 2018
06/18
by
Martin Jung; Stefan Schacht
texts
eye 2
favorite 0
comment 0
An extensive model-independent analysis of B->DD decays is carried out employing SU(3) flavour symmetry, including symmetry-breaking corrections. Several theoretically clean observables are identified which allow for testing the Standard Model. These include the known time-dependent CP asymmetries, the penguin pollution of which can be controlled in this framework, but notably also quasi-isospin relations which are experimentally well accessible and unaffected by symmetry-breaking...
Topics: High Energy Physics - Phenomenology, High Energy Physics - Experiment
Source: http://arxiv.org/abs/1410.8396
3
3.0
Jun 29, 2018
06/18
by
E. Buß; H. Hàn; M. Schacht
texts
eye 3
favorite 0
comment 0
We investigate minimum vertex degree conditions for $3$-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which only consecutive edges intersect and these intersections consist of precisely one vertex. We prove that every $3$-uniform $n$-vertex ($n$ even) hypergraph $\mathcal{H}$ with minimum vertex degree $\delta_1(\mathcal{H})\geq \left(\frac7{16}+o(1)\right)\binom{n}{2}$ contains a loose Hamilton cycle. This bound is...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1603.04462
2
2.0
Jun 29, 2018
06/18
by
Yoshiharu Kohayakawa; Mathias Schacht; Reto Spöhel
texts
eye 2
favorite 0
comment 0
Given two graphs $G$ and $H$, we investigate for which functions $p=p(n)$ the random graph $G_{n,p}$ (the binomial random graph on $n$ vertices with edge probability $p$) satisfies with probability $1-o(1)$ that every red-blue-coloring of its edges contains a red copy of $G$ or a blue copy of $H$. We prove a general upper bound on the threshold for this property under the assumption that the denser of the two graphs satisfies a certain balancedness condition. Our result partially confirms a...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1602.04059
4
4.0
Jun 28, 2018
06/18
by
E. Friedgut; H. Hàn; Y. Person; M. Schacht
texts
eye 4
favorite 0
comment 0
We establish sharpness for the threshold of van der Waerden's theorem in random subsets of $\mathbb{Z}/n\mathbb{Z}$. More precisely, for $k\geq 3$ and $Z\subseteq \mathbb{Z}/n\mathbb{Z}$ we say $Z$ has the van der Waerden property if any two-colouring of $Z$ yields a monochromatic arithmetic progression of length $k$. R\"odl and Ruci\'nski (1995) determined the threshold for this property for any k and we show that this threshold is sharp. The proof is based on Friedgut's criteria (1999)...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1512.05921
7
7.0
Oct 26, 2020
10/20
by
Schacht, Steven P
texts
eye 7
favorite 0
comment 0
xvii, 203 p. ; 23 cm
Topics: Feminism -- United States, Male feminists -- United States, Sex role -- United States, Man-woman...
3
3.0
Jun 29, 2018
06/18
by
Guilherme O. Mota; Gábor N. Sárközy; Mathias Schacht; Anusch Taraz
texts
eye 3
favorite 0
comment 0
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine asymptotically the two color Ramsey number for bipartite graphs with small bandwidth and bounded maximum degree and the three color Ramsey number for such graphs with the additional assumption that the bipartite graph is balanced.
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1602.05972
The advent of 5G promises a new age of speed and connectivity of mobile devices. Location-based services will reach a new state of accuracy as well. 4G/LTE implemented the timing advance group (TAG) to increase throughput by allowing user equipment (UE) to connect to multiple base stations (BSs). Timing advance (TA) commands are utilized in order to maintain time synchronization between each servicing BS by directing when the UE should transmit based on the distance to each associated BS. For...
Topics: 5G, timing advance group, TAG, location privacy, Cramér-Rao Lower Bound, CRLB, user equipment, UE,...
2
2.0
Jun 30, 2018
06/18
by
M. Schacht; M. M. Schauer
texts
eye 2
favorite 0
comment 0
A generalized probe sequence typical of trapped ion experiments using shelving is studied. Detection efficiency is analyzed for finite shelved state lifetimes and using multi-modal count distributions. Multi-modal distributions are more appropriate for measurements that use a small number of ions than the simple Poisson counting statistics usually considered and have a larger variance that may be significant in determining uncertainties and in making weighted fits. Optimal probe times and the...
Topics: Physics, Atomic Physics
Source: http://arxiv.org/abs/1402.5910
3
3.0
Jun 29, 2018
06/18
by
Vojtěch Rödl; Andrzej Ruciński; Mathias Schacht
texts
eye 3
favorite 0
comment 0
For given integers $k$ and $r$, the Folkman number $f(k;r)$ is the smallest number of vertices in a graph $G$ which contains no clique on $k+1$ vertices, yet for every partition of its edges into $r$ parts, some part contains a clique of order $k$. The existence (finiteness) of Folkman numbers was established by Folkman (1970) for $r=2$ and by Ne\v{s}et\v{r}il and R\"odl (1976) for arbitrary $r$, but these proofs led to very weak upper bounds on $f(k;r)$. Recently, Conlon and Gowers and...
Topics: Combinatorics, Mathematics
Source: http://arxiv.org/abs/1603.00521
0
0.0
Aug 28, 2021
08/21
by
Louisa Kulke; Lena Brümmer; Arezoo Pooresmaeili; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/7ec8y/
0
0.0
Aug 28, 2021
08/21
by
Louisa Kulke; Alex Lepauvre; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/xuntq/
0
0.0
Aug 18, 2021
08/21
by
Louisa Kulke; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/vbk2e/
0
0.0
Aug 18, 2021
08/21
by
Adi Lausen; Lars Penke; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/w2tgr/
0
0.0
Aug 24, 2021
08/21
by
Ronja Demel; Francesco Grassi; Yasaman Rafiee; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Even though there is a large amount of research on moral decision-making, most dilemmas that are used are very abstract from real life (e.g. trolley dilemmas). In case of the corona virus outbreak in late 2019/ early 2020 in that started in Wuhan, China there suddenly is a pandemic crisis that affects the whole world and poses a variety of real-life moral dilemmas. Even more interestingly, these moral dilemmas occur on different levels. Some are personal, some are posed on structural and...
Source: https://osf.io/ae3km/
301
301
May 6, 2010
05/10
by
Cullom, R. R.; Goldstein, A. W.; Schacht, R. L
texts
eye 301
favorite 0
comment 0
Overall stage and stator blade element performance with straight stator and tilted stator in transonic axial flow compressor stage
Topics: ROTORS, STATOR BLADES, STATORS, TRANSONIC FLOW, TURBOCOMPRESSORS, AXIAL FLOW COMPRESSOR, STATOR...
0
0.0
Aug 30, 2021
08/21
by
Ronja Demel; Tamara Ringel; Thomas Schultze; Jana Thiel; Michael R. Waldmann; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
The goal of the present study is to extend previous knowledge on the role of emotion in moral judgment by using event-related potentials and pupil dilation as indicators of the underlying intuitive responses towards morally associated faces. To this aim, we pair faces showing neutral expressions with morally positive, morally negative or neutral written scenarios where the person that is introduced through the face commits an act towards another person. In addition to explicit character...
Source: https://osf.io/q6fzy/
0
0.0
Aug 29, 2021
08/21
by
Louisa Kulke; Laura Janßen; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/c9mfq/
0
0.0
Sep 1, 2021
09/21
by
Marlene Wessels; Christian Valuch; Annekathrin Schacht; Louisa Kulke
data
eye 0
favorite 0
comment 0
Source: https://osf.io/z76sj/
0
0.0
Aug 29, 2021
08/21
by
Ronja Demel; Annekathrin Schacht; Arezoo Pooresmaeili
data
eye 0
favorite 0
comment 0
Source: https://osf.io/pzush/
0
0.0
Aug 29, 2021
08/21
by
Louisa Kulke; Hannah Gessler; Dennis Feyerabend; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/75j9z/
0
0.0
Aug 27, 2021
08/21
by
Annika C. Ziereis; Jantje Becker; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/b3fh2/
0
0.0
Sep 10, 2021
09/21
by
Louisa Kulke; Lina Johanna Meiners; Danilo Postin; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/4wrzf/
0
0.0
Aug 29, 2021
08/21
by
Marlene Wessels; Christian Valuch; Annekathrin Schacht; Louisa Kulke
data
eye 0
favorite 0
comment 0
Source: https://osf.io/fujpr/
0
0.0
Aug 29, 2021
08/21
by
Louisa Kulke; Lena Brümmer; Arezoo Pooresmaeili; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/4kscq/
0
0.0
Aug 30, 2021
08/21
by
Louisa Kulke; Arezoo Pooresmaeili; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/324ds/
0
0.0
Sep 2, 2021
09/21
by
Yasaman Rafiee; Louisa Kulke; Adi Lausen; Annekathrin Schacht
data
eye 0
favorite 0
comment 0
Source: https://osf.io/u2cem/
60
60
Aug 27, 2016
08/16
by
Chamber Orchestra La Strimpellata Bern / Vocal Ensemble Cantemus - Helene Ringgenberg / Hansjürg Kuhn, Piano, Michael Schacht, Speaker, Hans-Jürg Rickenbacker, Ten.
audio
eye 60
favorite 0
comment 0
Tracklist: 1. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of The Old Masters: 1. Adam De La Halle, 1250 2. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of The Old Masters: 2. Ludwig Senfl, 1510 3. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of The Old Masters: 3. George Frideric Handel, 1730 4. Clementi Cabin 3000m Above Sea Level, MWV. 459 (1940): 27 Autogrammes In The Style Of...
Source: CD
4
4.0
Jun 20, 2021
06/21
by
Helle Blomberg Schacht (MakerHelle)
data
eye 4
favorite 0
comment 0
Lasercut
Topics: plywood, veneer, thingiverse, Other, makerspace, stl, chart, Lasercut, viamake, wood
